KISS: A Simple Prefix Search Scheme in P2P Networks∗ Yuh-Jzer Joung Li-Wei Yang

Source URL: db.ucsd.edu

• Distributed data storage
• File sharing networks
• File sharing
• Chord
• Gnutella
• Trie
• B-tree
• Reserved word
• T-tree
• Peer-to-peer
• Distributed hash table
• Kademlia

Content and Structure in Indexing and Ranking XML Felix Weigel∗ ∗ Centre Holger Meuss†

Source URL: webdb2004.cs.columbia.edu

• Query languages
• XML retrieval
• Data management
• Information retrieval
• Ranking
• Search engine indexing
• Document retrieval
• Search engine technology
• XML tree
• XQuery
• Inverted index
• XPath

TOP-K Projection Queries for Probabilistic Business Processes Daniel Deutch Tova Milo {danielde,milo}@cs.tau.ac.il

Source URL: www.cs.tau.ac.il

• Routing algorithms
• Search algorithms
• Combinatorial optimization
• Flow network
• Operations research
• A* search algorithm
• Tree
• Oblivious data structure

HIERARCHICAL GRID STRUCTURES FOR STATIC GEOGRAPHIC DATA BASES Andreas Kleiner and Kurt E. Brassel Department of Geography University of Zurich Winterthurerstr. 190

Source URL: mapcontext.com

• Search algorithms
• Hashing
• Arrays
• Quadtree
• Grid file
• Grid
• Hash function
• Extendible hashing
• Data
• Linear hashing
• Trie
• B-tree

Introduction to Algorithms Massachusetts Institute of Technology Professors Erik Demaine, Piotr Indyk, and Manolis Kellis March 9, Spring 2011

Source URL: courses.csail.mit.edu

• Analysis of algorithms
• Binary trees
• Computational complexity theory
• Asymptotic analysis
• Sorting algorithms
• Best
• worst and average case
• Binary heap
• Heap
• Time complexity
• Hash table
• Binary search tree
• Master theorem

B-trees, Shadowing, and Clones Ohad Rodeh IBM Haifa Research Labs B-trees are used by many file-systems to represent files and directories. They provide guarantied logarithmic time key-search, insert, and remove. File sy

Source URL: liw.fi

• B-tree
• Learning
• Graph theory
• Computing
• B+ tree
• Trie
• Tree
• Btrfs
• Hilbert R-tree

IEEE Trans. on Comput’l Intel. and AI in Games (special issue: Monte Carlo Techniques and Computer Go) vol 2 no 4 DecMonte Carlo Tree Search in Hex Broderick Arneson, Ryan B. Hayward, Philip Henderson

Source URL: webdocs.cs.ualberta.ca

ballbotGracefulNavigation.dvi

Source URL: www.msl.ri.cmu.edu

• Robotics
• Ballbot
• Robot kinematics
• Search algorithms
• Motion planning
• Humanoid robot
• Motion
• Robot
• Rapidly-exploring random tree
• Mobile robot

Transpositions and Move Groups in Monte Carlo Tree Search Benjamin E. Childs, Member, IEEE, James H. Brodeur, and Levente Kocsis. Abstract— Monte Carlo search, and specifically the UCT (Upper Confidence Bounds applied

Source URL: www.csse.uwa.edu.au

• Game artificial intelligence
• Monte Carlo tree search
• Transposition table
• Alphabeta pruning
• Minimax
• Game tree
• Tree traversal
• Computer Go
• Monte Carlo method
• UCT
• Tree
• General game playing

XTC: A Practical Topology Control Algorithm for Ad-Hoc Networks Roger Wattenhofer and Aaron Zollinger {wattenhofer, zollinger}@inf.ethz.ch Department of Computer Science, ETH Zurich 8092 Zurich, Switzerland

Source URL: disco.ethz.ch

• Graph theory
• Mathematics
• NP-complete problems
• Spanning tree
• Edsger W. Dijkstra
• Routing algorithms
• Search algorithms
• Topology control
• Unit disk graph
• Connectivity
• Minimum spanning tree
• Bipartite graph